منابع مشابه
The graph bottleneck identity
A matrix S = (sij) ∈ R n×n is said to determine a transitional measure for a digraph Γ on n vertices if for all i, j, k ∈ {1, . . . , n}, the transition inequality sij sjk ≤ sik sjj holds and reduces to the equality (called the graph bottleneck identity) if and only if every path in Γ from i to k contains j. We show that every positive transitional measure produces a distance by means of a loga...
متن کاملA Graph Bottleneck Inequality
For a weighted directed multigraph, let fij be the total weight of spanning converging forests that have vertex i in a tree converging to j. We prove that fij fjk = fik fjj if and only if every directed path from i to k contains j (a graph bottleneck equality). Otherwise, fij fjk < fik fjj (a graph bottleneck inequality). In a companion paper [1] (P. Chebotarev, A new family of graph distances,...
متن کاملthe crisis of identity in jhumpa lahiris fiction: interpreter of maladies and the namesake
شکل گیری هویت(identity) مقوله مهمی در ادبیات پراکنده مردم(diasporan literature) می باشد. آثار جومپا لاهیری(jhumpa lahiri) ، نویسنده هندی آمریکایی، در سالهای اخیر تحسین منتقدین را به خود معطوف کرده است. وی در این آثار زندگی مهاجران و تلاش آنان برای پیدا کردن جایگاهشان در یک فرهنگ بیگانه را به تصویر کشیده است. این تجربه همواره با احساساتی نظیر دلتنگی برای گذشته، بیگانگی و دوری همراه است. با این ح...
15 صفحه اولUsing eigenvectors of the bigram graph to infer morpheme identity
This paper describes the results of some experiments exploring statistical methods to infer syntactic categories from a raw corpus in an unsupervised fashion. It shares certain points in common with Brown et at (1992) and work that has grown out of that: it employs statistical techniques to derive categories based on what words occur adjacent to a given word. However, we use an eigenvector deco...
متن کاملThe Reduceron: Widening the von Neumann Bottleneck for Graph Reduction Using an FPGA
For the memory intensive task of graph reduction, modern PCs are limited not by processor speed, but by the rate that data can travel between processor and memory. This limitation is known as the von Neumann bottleneck. We explore the effect of widening this bottleneck using a special-purpose graph reduction machine with wide, parallel memories. Our prototype machine – the Reduceron – is implem...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Advances in Applied Mathematics
سال: 2011
ISSN: 0196-8858
DOI: 10.1016/j.aam.2010.11.001